Macroexpansion Re ective Tower
نویسنده
چکیده
Macros are re ective tools that operate on the representation of programs. Though having been used, and still being useful, for more than thirty years, their semantics and pragmatics are still unclear. This paper proposes a new model to understand the macroexpansion process; this model is based on a re ective tower of macroexpansion engines.
منابع مشابه
A Simple Re ective Interpreter Stanley Je erson
Procedurally re ective programming languages enable user programs to semantically extend the language itself, by permitting them to run at the level of the language implementation with access to their context. The re ective tower, rst introduced by Brian Smith [9, 10], is the principal architecture for such languages. It is informally described as an in nitely ascending tower of meta-circular i...
متن کاملTowards a Theory of Re ective Programming Languages (
This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v -calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish ...
متن کاملDuplication and Partial Evaluation | for a Better Understanding of Re Blockinective Languages |
This paper presents a general implementation framework for re ective languages. It allows us to systematically build re ective languages which have the following favorable properties: (1) user programs are allowed to access and change (parts of) metalevel interpreters, (2) re ective facilities are available at every level, (hence there exists conceptually an in nite tower of interpreters), and ...
متن کاملTowards a theory of reflective programming languages
This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v-calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish p...
متن کاملAxiomatizing Re ective Logics and Languages
The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re e...
متن کامل